Worst-Case Complexity of the Optimal LLL Algorithm
نویسنده
چکیده
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter t of the algorithm has its extreme value 1. This case is of interest because the output is then the strongest Lovász–reduced basis. Experiments reported by Lagarias and Odlyzko [LO83] seem to show that the algorithm remain polynomial in average. However no bound better than a naive exponential order one is established for the worst– case complexity of the optimal LLL algorithm, even for fixed small dimension (higher than 2). Here we prove that, for any fixed dimension n, the number of iterations of the LLL algorithm is linear with respect to the size of the input. It is easy to deduce from [Val91] that the linear order is optimal. Moreover in 3 dimensions, we give a tight bound for the maximum number of iterations and we characterize precisely the output basis. Our bound also improves the known one for the usual (non–optimal) LLL algorithm.
منابع مشابه
Segment LLL Reduction of Lattice Bases Using Modular Arithmetic
The algorithm of Lenstra, Lenstra, and Lovász (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of O(n) using modular arithmetic. Koy and Schnorr developed a segment-LLL basis reduction algorithm that generates lattice basis satisfying a weaker condition than the LLL reduced basis with O(n) improvemen...
متن کاملComplexity results for factoring univariate polynomials over the rationals (version 0.3)
In [6] Zassenhaus gave an algorithm for factoring polynomials f ∈ Q[x]. In this algorithm one has to solve a combinatorial problem of size r, where r is the number of local factors of f at some suitably chosen prime p. This combinatorial problem consists of selecting the right subsets of the set of local factors. In the worst case, the algorithm [6] ends up trying 2r−1 such subsets (if a subset...
متن کاملAdaptive Precision Floating Point LLL
The LLL algorithm is one of the most studied lattice basis reduction algorithms in the literature. Among all of its variants, the floating point version, also known as L, is the most popular one, due to its efficiency and its practicality. In its classic setting, the floating point precision is a fixed value, determined by the dimension of the input basis at the initiation of the algorithm. We ...
متن کاملAn LLL Algorithm with Quadratic Complexity
The Lenstra–Lenstra–Lovász lattice basis reduction algorithm (called LLL or L3) is a fundamental tool in computational number theory and theoretical computer science, which can be viewed as an efficient algorithmic version of Hermite’s inequality on Hermite’s constant. Given an integer d-dimensional lattice basis with vectors of Euclidean norm less than B in an ndimensional space, the L3 algori...
متن کاملCryptographic Functions from Worst-Case Complexity Assumptions
Lattice problems have been suggested as a potential source of computational hardness to be used in the construction of cryptographic functions that are provably hard to break. A remarkable feature of lattice-based cryptographic functions is that they can be proved secure (that is, hard to break on the average) based on the assumption that the underlying lattice problems are computationally hard...
متن کامل